An Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem
نویسنده
چکیده
Ant Colony optimization has proved suitable to solve a wide range of combinatorial optimization (or NP-hard) problems as the Travelling Salesman Problem (TSP). The first step of ACO algorithm is to set the parameters that drive the algorithm. The parameter has an important impact on the performance of the ant colony algorithm. The basic parameters that are used in ACO algorithms are; the relative importance (or weight) of pheromone, the relative importance of heuristics value, initial pheromone value, evaporation rate, and a parameter to control exploration or exploitation. In this Paper we present the effect of parameter on ACO algorithm for solving Travelling Salesman Problem for 52 nodes. Keywords— Ant Colony Optimization; Parameter tuning in ACO; Travelling salesman problem
منابع مشابه
A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کاملA combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem
The algorithm of Ant Colony System (ACS) has been found attractive for solving combinatorial optimization problem such as Travelling Salesman Problem (TSP). The run-time for this algorithm increases with increase in number of nodes. In this paper, we propose an efficient method that reduces the run-time for very large-scale Euclidean TSP problem and yet conserve the quality of solution for cert...
متن کاملA Novel Approach To Solve Tsp Using Ant Colony Optimization
ABSTRACT: Travelling salesman problem (TSP) is a routing problem, which is a sub-problem of many application domains such as transportation, network communication. In this paper, we propose a novel methodology which solves the problem ACO algorithm has defined with well distribution strategy in which total search space area is partition into P numbers of hyper-cubic quadrants where P is the dim...
متن کامل